A Counterexample to Tensorability of Effects
نویسندگان
چکیده
Monads are widely used in programming semantics and in functional programming to encapsulate notions of side-effect, such as state, exceptions, input/output, or continuations. One of their advantages is that they allow for a modular treatment of effects, using composition operators such as sum and tensor. Here, the sum represents the non-interacting combination of effects, while the tensor imposes a high degree of interaction in the shape of a commutation law. Although many important effects are ranked, i.e. presented by algebraic operations of bounded arity, there is also a range of relevant unranked effects, with prominent examples including continuations and unbounded non-determinism. While the sum and tensor of ranked effects always exist, this is not so clear already when one of the components is unranked, in which case size problems come into play. In contrast to the case of sums where a counterexample can be constructed rather trivially, the general existence of tensors has, so far, been an open issue — as the tensor identifies more terms than the sum, it does exist in many cases where the sum fails to exist. As a possible counterexample, tensors of continuations with unranked effects have been discussed; however, we have disproved that possibility in recent work. In the present work, we nevertheless settle the question in the negative by presenting a well-order monad whose tensor with a simple ranked monad fails to exist; as a consequence, we show also that there is an unranked monad whose tensor with the finite list monad fails to exist.
منابع مشابه
On the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملON COMULTIPLICATION AND R-MULTIPLICATION MODULES
We state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. In particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. Also we show that if M is an strong comultiplicati...
متن کاملGenerating Diagnoses for Probabilistic Model Checking Using Causality
One of the major advantages of model checking over other formal methods of verification is its ability to generate an error trace when the specification is falsified in the model. We call this trace a counterexample. In probabilistic model checking (PMC), counterexample generation has a quantitative aspect. The counterexample is a set of paths in which a path formula holds, and their accumulate...
متن کاملA 64-Dimensional Counterexample to Borsuk's Conjecture
Bondarenko’s 65-dimensional counterexample to Borsuk’s conjecture contains a 64-dimensional counterexample. It is a two-distance set of 352 points.
متن کاملDebugging of Markov Decision Processes (MDPs) Models
In model checking, a counterexample is considered as a valuable tool for debugging. In Probabilistic Model Checking (PMC), counterexample generation has a quantitative aspect. The counterexample in PMC is a set of paths in which a path formula holds, and their accumulative probability mass violates the probability threshold. However, understanding the counterexample is not an easy task. In this...
متن کامل